Object replication strategies in content distribution networks

نویسندگان

  • Jussi Kangasharju
  • James W. Roberts
  • Keith W. Ross
چکیده

Recently the Internet has witnessed the emergence of content distribution networks (CDNs). In this paper we study the problem of optimally replicating objects in CDN servers. In our model, each Internet Autonomous System (AS) is a node with nite storage capacity for replicating objects. The optimization problem is to replicate objects so that when clients fetch objects from the nearest CDN server with the requested object, the average number of ASs traversed is minimized. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. We develop four natural heuristics and compare them numerically using real Internet topology data. We nd that the best results are obtained with heuristics that have all the CDN servers cooperating in making the replication decisions. We also develop a model for studying the bene ts of cooperation between nodes, which provides insight into peer-to-peer content distribution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improve Replica Placement in Content Distribution Networks with Hybrid Technique

The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...

متن کامل

Storage Capacity Allocation Algorithms for Hierarchical Content Distribution

The addition of storage capacity in network nodes for the caching or replication of popular data objects results in reduced end-user delay, reduced network traffic, and improved scalability. The problem of allocating an available storage budget to the nodes of a hierarchical content distribution system is formulated; optimal algorithms, as well as fast/efficient heuristics, are developed for it...

متن کامل

On the optimization of storage capacity allocation for content distribution

The addition of storage capacity in network nodes for the caching or replication of popular data objects results in reduced end-user delay, reduced network traffic, and improved scalability. The problem of allocating an available storage budget to the nodes of a hierarchical content distribution system is formulated; optimal algorithms, as well as fast/efficient heuristics, are developed for it...

متن کامل

Local Utility Aware Content Replication

A commonly employed abstraction for studying the object placement problem for the purpose of Internet content distribution is that of a distributed replication group. In this work the initial model of distributed replication group of Leff, Wolf, and Yu (IEEE TPDS ’93) is extended to the case that individual nodes act selfishly, i.e., cater to the optimization of their individual local utilities...

متن کامل

Optimization Strategies for Qos-sensitive Vod Service Delivery in Cooperative Environments

Multimedia services such video-on-demand service to large number of clients require stable network bandwidth provision and short network delay. In order to achieve these goals, the object replication in overlay P2P networks in a good candidate solution for both service providers and customers. However, the characteristics of peers are different from traditional content distribution infrastructu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Communications

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2002